FAST TARGET EXTRACTION BASED ON BAYESIAN BLOB ANALYSIS AND SIMULATED ANNEALING FOR UNDERWATER IMAGES
نویسندگان
چکیده
منابع مشابه
Fast Simulated Re - Annealing
An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...
متن کاملA fast algorithm of bitstream extraction using distortion prediction based on simulated annealing
Scalable video streams can be extracted to meet the bandwidth limitation of different networks and end-users. Bitstream extraction is usually performed at the network proxy or gateway during transmission, where a low computational complexity is always preferred. How to quickly and accurately select the best resolution combination for a video to meet different bandwidth requirements by each user...
متن کاملFast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulated annealing algorithm is developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hypothesized object and an image. The normalized correlation coefficient is used as a measure of the match. Templates are generated on-line during the search by transforming model images. Simulated annealing reduces t...
متن کاملA Fast Kinoform Optimization Algorithm Based on Simulated Annealing
Computer Generated Holography (CGH) [7] is a technique which generate a hologram by using computers. The CGH can be used in many applications, such as optical interconnection, optical information, optical elements and so on. The great advantage of the CGH is that it can be generate a hologram of virtual objects. The kinoform [6], one of the CGHs, is an attractive device that can manage wave fro...
متن کاملA Fast KNN Algorithm Based on Simulated Annealing
-K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k nearest neighbors quickly. Simulated annealing algorithm and inverted array are used to help find out the expected neighbors. Our experimental results demonstrate a significant improvement in classification computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Robotics and Automation
سال: 2017
ISSN: 1925-7090
DOI: 10.2316/journal.206.2017.2.206-4347